Revisiting SRT Quotient Digit Selection

نویسنده

  • Peter Kornerup
چکیده

The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a redundant representation. The number of leading bits needed depends on the quotient radix and digit set, and is usually found by an extensive search, to assure that the next quotient digit can be chosen as valid for all points (remainder,divisor) in a set defined by the truncated remainder and divisor, i.e., an “uncertainty rectangle”. This paper presents expressions for the number of bits needed for the truncated remainder and divisor, thus eliminating the need for a search through the truncation parameter space for validation. It also presents simple algorithms to properly map truncated negative divisors and remainders into non-negative values, allowing the quotient selection function only to be defined on the smaller domain of non-negative values.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prescaled Integer Division

We describe a high radix integer division algorithm where the divisor is prescaled and the quotient is postscaled without modifying the dividend to obtain an identity with the quotient differing from the desired integer quotient only in its lowest order high radix digit. Here the “oversized” partial remainder is bounded by the scaled divisor with at most one additional high radix digit selectio...

متن کامل

Division with Speculation of the Quotient Digits

Progress in VLSI technology has made possible the hardware implementation of all the basic arithmetic operations in the design of general-purpose as well as special-purpose processors. While operations such as multiplication and sum have been extensively studied and fast implementations are possible, the design of fast and eecient circuits for division is still challenging. The factor that limi...

متن کامل

Minimizing the complexity of SRT tables

This paper presents an analysis of the complexity of quotient-digit selection tables in SRT division implementations. SRT dividers are widely used in VLSI systems to compute floating-point quotients. These dividers use a fixed number of partial remainder and divisor bits to consult a table to select the next quotient-digit in each iteration. This analysis derives the allowable divisor and parti...

متن کامل

A Radix-16 SRT Division Unit with Speculation of the Quotient Digits

The speed of a divider based on a digit-recurrence algorithm depends mainly on the latency of the quotient digit generation function. In this paper we present an analytical approach that extends the theory developed for standard SRT division and permits to implement division schemes where a simpler function speculates the quotient digit. This leads to division units with shorter cycle time and ...

متن کامل

Design of a fast radix-4 SRT divider and its VLSI implementation

The design of a fast divider is an important issue in high-speed computing. The paper presents a fast radix-4 SRT division architecture. Instead of ®nding the correct quotient digit, an estimated quotient digit is ®rst speculated. The speculated quotient digit is used to simultaneously compute the two possible partial remainders for the next step while the quotient digit is being corrected. Thu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003